math/big.nat.cmp (method)

31 uses

	math/big (current package)
		int.go#L151: 		if x.abs.cmp(y.abs) >= 0 {
		int.go#L172: 		if x.abs.cmp(y.abs) >= 0 {
		int.go#L382: 		r = x.abs.cmp(y.abs)
		int.go#L400: 	return x.abs.cmp(y.abs)
		int.go#L784: 	if A.abs.cmp(B.abs) < 0 {
		nat.go#L156: func (x nat) cmp(y nat) (r int) {
		nat.go#L936: 		if z.cmp(limit) < 0 {
		nat.go#L1286: 	if zz.cmp(m) >= 0 {
		nat.go#L1295: 		if zz.cmp(m) >= 0 {
		nat.go#L1366: 	if x.cmp(natOne) <= 0 {
		nat.go#L1386: 		if z2.cmp(z1) >= 0 {
		nat.go#L1416: 	if x.cmp(y) >= 0 {
		natconv.go#L381: 			if table[index].nbits >= maxLength && table[index].bbb.cmp(q) >= 0 {
		natdiv.go#L523: 	if u.cmp(v) < 0 {
		natdiv.go#L839: 			e := qhatv.cmp(uu.norm())
		natdiv.go#L850: 		if qhatv.cmp(uu.norm()) > 0 {
		natdiv.go#L875: 		if e := qhatv.cmp(u.norm()); e > 0 {
		natdiv.go#L884: 	if qhatv.cmp(u.norm()) > 0 {
		prime.go#L107: 		if y.cmp(natOne) == 0 || y.cmp(nm1) == 0 {
		prime.go#L113: 			if y.cmp(nm1) == 0 {
		prime.go#L116: 			if y.cmp(natOne) == 0 {
		prime.go#L152: 	if len(n) == 0 || n.cmp(natOne) == 0 {
		prime.go#L158: 		return n.cmp(natTwo) == 0
		prime.go#L198: 			if t1.cmp(n) == 0 {
		prime.go#L280: 	if vk.cmp(natTwo) == 0 || vk.cmp(nm2) == 0 {
		prime.go#L290: 		if t1.cmp(t2) < 0 {
		rat.go#L401: 	return len(x.b.abs) == 0 || x.b.abs.cmp(natOne) == 0
		ratconv.go#L357: 	if x.b.abs.cmp(r2) <= 0 {
		ratconv.go#L359: 		if r.cmp(p) >= 0 {